A note on orthogonal double covers of complete bipartite graphs by a special class of six caterpillars
نویسندگان
چکیده
We construct orthogonal double covers of Kn,n by Pm+1 ∪∗ Sn−m, where n and m are integers, 2 ≤ m ≤ 10, m ≤ n and Pm+1 ∪∗ Sn−m is a tree obtained from the path Pm+1 with m edges and a star Sn−m with n − m edges by identifying an end-vertex of Pm+1 with the center of Sn−m.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملOn Cartesian Products of Orthogonal Double Covers
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, where G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H and share no edges whenever the corresponding vertices are nonadjacent in H. In this paper, we are concerned with ...
متن کاملOrthogonal double covers of complete bipartite graphs
Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...
متن کاملOrthogonal Double Covers of Complete Graphs by Fat Caterpillars
An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...
متن کاملOrthogonal Double Covers of Complete Graphs by Trees
Gronau, Mullin, and Rosa conjectured that for every tree T with n vertices except for P4 there exists an ODC of Kn by T . They also proved the conjecture for all caterpillars of diameter 3. Later, Leck and Leck proved it for all caterpillars of diameter 4 and all trees with up to 14 vertices. We prove the conjecture for all carerpillars of diameter 5 and order n ≥ 24; for orders 15 ≤ n ≤ 23 we ...
متن کامل